Erasure/List Exponents for Slepian–Wolf Decoding
نویسندگان
چکیده
منابع مشابه
Smaller Decoding Exponents: Ball-Collision Decoding
Very few public-key cryptosystems are known that can encrypt and decrypt in time b with conjectured security level 2 against conventional computers and quantum computers. The oldest of these systems is the classic McEliece code-based cryptosystem. The best attacks known against this system are generic decoding attacks that treat McEliece’s hidden binary Goppa codes as random linear codes. A sta...
متن کاملMismatched Decoding: Finite-Length Bounds, Error Exponents and Approximations
This paper considers the problem of channel coding with a given (possibly suboptimal) decoding rule. Finite-length upper and lower bounds on the random-coding error probability for a general codeword distribution are given. These bounds are applied to three random-coding ensembles: i.i.d., constant-composition, and cost-constrained. Ensembletight error exponents are presented for each ensemble,...
متن کاملHURST EXPONENTS FOR NON-PRECISE DATA
We provide a framework for the study of statistical quantitiesrelated to the Hurst phenomenon when the data are non-precise with boundedsupport.
متن کاملIRWIN AND JOAN JACOBS CENTER FOR COMMUNICATION AND INFORMATION TECHNOLOGIES List Decoding − Random Coding Exponents and Expurgated Exponents
Some new results are derived concerning random coding error exponents and expurgated exponents for list decoding with a deterministic list size L. Two asymptotic regimes are considered, the fixed list–size regime, where L is fixed independently of the block length n, and the exponential list–size, where L grows exponentially with n. We first derive a general upper bound on the list–decoding ave...
متن کاملAchievable error exponents for channel with side information - erasure and list decoding
We consider a decoder with an erasure option and a variable size list decoder for channels with non-casual side information at the transmitter. First, universally achievable error exponents are offered for decoding with an erasure option using a parameterized decoder in the spirit of Csiszár and Körner’s decoder. Then, the proposed decoding rule is generalized by extending the range of its para...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2014
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2014.2328602